Back to Massey: Impressively Fast, Scalable and Tight Security Evaluation Tools
نویسندگان
چکیده
None of the existing rank estimation algorithms can scale to large cryptographic keys, such as 4096-bit (512 bytes) RSA keys. In this paper, we present the first solution to estimate the guessing entropy of arbitrarily large keys, based on mathematical bounds, resulting in the fastest and most scalable security evaluation tool to date. Our bounds can be computed within a fraction of a second, with no memory overhead, and provide a margin of only a few bits for a full 128-bit AES key.
منابع مشابه
Levinson-Durbin Algorithm Used for Fast BCH Decoding
BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm, which requires about O(t) computational steps, where t is the error-correction capability of the BCH code. The evaluation of the errorlocator polynomial may also be computed using fast inversion techniques for Hankel matrices. It will be shown that only O(lt)...
متن کاملFormal approach on modeling and predicting of software system security: Stochastic petri net
To evaluate and predict component-based software security, a two-dimensional model of software security is proposed by Stochastic Petri Net in this paper. In this approach, the software security is modeled by graphical presentation ability of Petri nets, and the quantitative prediction is provided by the evaluation capability of Stochastic Petri Net and the computing power of Markov chain. Each...
متن کاملIntelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملFast Inversion of Hankel Systems and E cient BCH 1 Decoding
| BCH decoding usually involves the evaluation of the error-locator polynomial. This is often achieved with the Berlekamp-Massey algorithm. The evaluation of the error-locator polynomial may also be computed using fast inversion techniques for Hankel matrices. It can be shown that O(lt) steps are necessary, with l being the number of errors which occurred and t being the error-correction capabi...
متن کاملSecurity Research and Learning Environment Based on Scalable Network Emulation
Subject review Security attacks are becoming a standard part of the Internet and their frequency is constantly increasing. Therefore, an efficient way to research and investigate attacks is needed. Studying attacks needs to be coupled with security evaluation of currently deployed systems that are affected by them. The security evaluation and research process needs to be completed quickly to co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017